Low Complexity Two-Stage Soft/Hard Decoders
نویسندگان
چکیده
Next generation wireless systems will need higher spectral efficiency as the expected traffic volumes per unit bandwidth and dimension will inevitably grow. As a consequence, it is necessary to design coding schemes with performances close to the theoretical limits, having high flexibility and low complexity requirements at transmitter and receiver. In this paper, we point out some of the limitations of the Bit Interleaved Code Modulation (BICM) technique which is the state of the art adopted in several standards and then propose some new lower complexity alternatives. These low complexity alternatives are obtained by applying the recently introduced Analog Digital Belief Propagation (ADBP) algorithm to a two stage encoding scheme embedding a hard decoding stage. First we show that for PAM type constellations over the AWGN channel, the performance loss caused by using a hard decoded stage for all modulation bits except the two least protected is negligible. Next, we consider the application of two stage decoders to more challenging Rician channels, showing that in this case the number of bits needed to be soft decoded depends on the Rician factor and increases to a maximum of three bits per dimension for the Rayleigh channel. Finally, we apply the ADBP algorithm to further reduce the detection and decoding complexity.
منابع مشابه
Soft decision decoding of the orthogonal complex MIMO codes for three and four transmit antennas
Orthogonality is a much desired property for MIMO coding. It enables symbol-wise decoding, where the errors in other symbol estimates do not affect the result, thus providing an optimality that is worth pursuing. Another beneficial property is a low complexity soft decision decoder, which for orthogonal complex MIMO codes is known for two transmit (Tx) antennas i.e. for the Alamouti code. We pr...
متن کاملOn the Decoding of Certain Generalized Concatenated Convolutional Codes
Concatenated Convolutional Codes Jung-Fu Cheng [email protected] Abstract Two classes of generalized concatenated (GC) codes with convolutional outer codes are studied. The rst class is based on the classical Plotkin ja bjbj construction. A new suboptimal multi-stage soft decision algorithm is proposed and the corresponding performance bounds are obtained. These codes are shown to achieve...
متن کاملImproved Decoding of linear Block Codes using compact Genetic Algorithms with larger tournament size
Soft-decision decoding is a very important NP-hard problem for developers of communication systems. In this work we propose two new dual domain soft decision decoders that use compact Genetic Algorithm (cGA) with larger tournament size: the first algorithm investigates tournament selection with larger size using mutation, and the second employs higher selection pressure with randomly generated ...
متن کاملReed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding
Reed-Solomon (RS) codes over GF(2) have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft decoding for high-rate (about 0.9) RS codes over large fields (GF(256), say) continues to remain a subject of...
متن کاملHard and Soft Spherical-Bound Stack decoder for MIMO systems
Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a novel sequential algorithm which combines the stack algorithm search strategy and the sphere decoder search region. The proposed decoder that we call the Spher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.03242 شماره
صفحات -
تاریخ انتشار 2017